A Comparison of Benson’s Outer Approximation Algorithm with an Extended Version of Multiobjective Simplex Algorithm

The multiple objective simplex algorithm and its variants work in the decision variable space to find set of all efficient extreme points linear programming (MOLP). Other approaches problem either entire solutions or a subset them also return corresponding values (nondominated points). This paper presents an extension multiobjective (MSA) generate nondominated no redundant ones. extended version is compared Benson’s outer approximation (BOA) that computes problem. Numerical results on nontrivial MOLP problems show total number returned by MSA same as BOA for most considered.